Boundary Controlled Iterated Function Systems
نویسندگان
چکیده
Boundary Controlled Iterated Function Systems is a new layer of control over traditional (linear) IFS, allowing creation of a wide variety of shapes. In this work, we demonstrate how subdivision schemes may be generated by means of Boundary Controlled Iterated Function Systems, as well as how we may go beyond the traditional subdivision schemes to create free-form fractal shapes. BC-IFS is a powerful tool allowing creation of an object with a prescribed topology (e.g. surface patch) independent of its geometrical texture. We also show how to impose constraints on the IFS transformations to guarantee the production of smooth shapes.
منابع مشابه
Rotation number and its properties for iterated function and non-autonomous systems
The main purpose of this paper is to introduce the rotation number for non-autonomous and iterated function systems. First, we define iterated function systems and the lift of these types of systems on the unit circle. In the following, we define the rotation number and investigate the conditions of existence and uniqueness of this number for our systems. Then, the notions rotational entropy an...
متن کاملDIMENSION OF THE BOUNDARY OF THE LÉVY DRAGON By :
A theoretical approach to computing the Hausdorff dimension of the topological boundary of attractors of iterated function systems is developed. The curve known as the Lévy Dragon is then studied in detail and the Hausdorff dimension of its boundary is computed using the theory developed. The actual computation is a complicated procedure. It involves a great deal of combinatorial topology as we...
متن کاملThe Hausdorff Dimension of the Boundary of the Lévy Dragon
A theoretical approach to computing the Hausdorff dimension of the topological boundary of attractors of iterated function systems is developed. The curve known as the Lévy Dragon is then studied in detail and the Hausdorff dimension of its boundary is computed using the theory developed. The actual computation is a complicated procedure. It involves a great deal of combinatorial topology as we...
متن کاملAccumulation points of iterated function systems
The sequence {Fn} is called the iterated function system corresponding to {fn}. For readability, we denote by F(Ω, X) the set of all iterated function systems made from functions in Hol(Ω, X). By Montel’s theorem (see for example [2]), the sequence Fn is a normal family, and every convergent subsequence converges uniformly on compact subsets of Ω to a holomorphic function F ∈ Hol(Ω, X). The acc...
متن کاملAccumulation constants of iterated function systems with Bloch target domains
The sequence {Fn} is called the iterated function system coming from the sequence f1, f2, f3, . . .; we abbreviate this to IFS. By Montel’s theorem (see for example [3]), the sequence Fn is a normal family, and every convergent subsequence converges uniformly on compact subsets of ∆ to a holomorphic function F . The limit functions F are called accumulation points. Therefore every accumulation ...
متن کامل